Turing Complete Catalytic Particle Computers
نویسندگان
چکیده
The Bare Bones language is a programming language with a minimal set of operations that exhibits universal computation. We present a conceptual framework, Chemical Bare Bones, to construct Bare Bones programs by programming the state transitions of a multifunctional catalytic particle. Molecular counts represent program variables, and are altered by the action of the catalytic particle. Chemical Bare Bones programs have unique properties with respect to correctness and time complexity. The Chemical Bare Bones implementation is naturally suited to parallel computation. Chemical Bare Bones programs are constructed and stochastically modeled to undertake computations such as multiplication.
منابع مشابه
Turing Machines and Semantic Symbol Processing: Why Real Computers Don't Mind Chinese Emperors
Philosophical questions about minds and computation need to focus squarely on the mathematical theory of Turing machines (TM's). Surrogate TM's such as computers or formal systems lack abilities that make Turing machines promising candidates for possessors of minds. Computers are only universal Turing machines (UTM's)|a conspicuous but unrepresentative subclass of TM. Formal systems are only st...
متن کاملCAPTCHA Based Web Security: An Overview
Completely Automatic Public Turing test to tell Computers and Humans Apart (CAPTCHA) is a HIP (Human interactive Proof) system. CAPTCHAs are used to improve the security of Internet based applications in order to ensure that a web based application which is intended to be used by a human being is not maliciously used by Artificially Intelligent programs called bots. As the current CAPTCHA metho...
متن کاملThe lambda - q calculus can efficiently simulate quantum computers
We show that the lambda-q calculus can efficiently simulate quantum Turing machines by showing how the lambda-q calculus can efficiently simulate a class of quantum cellular automaton that are equivalent to quantum Turing machines. We conclude by noting that the lambda-q calculus may be strictly stronger than quantum computers because NP-complete problems such as satisfiability are efficiently ...
متن کاملFrom Digital computers to quantum computers based on biological paradigms and progress in particle physics
While several paths have emerged recently in microelectronics and computing as follow-on’s to Turing architectures implemented using essentially silicon circuits, very little “Beyond Moore” research has considered, first biological processes instead of sequential instructions, and, next the implementation of these processes exploiting particle physics interactions. This combination allows e.g. ...
متن کاملMolecular Computing
We design a molecular Turing machine and determine the complexity of the problems solvable by molecular computers. In A94], a combinatorial molecular experiment to solve the NP-complete problem of Hamiltonian Path was proposed and implemented. Using our design, we show that such molecular computers can in fact compute PSPACE, under the generous assumptions implicit in A94]. Under stronger and s...
متن کامل